Category-measure duality: convexity, midpoint convexity and Berz sublinearity
نویسندگان
چکیده
منابع مشابه
Discrete Midpoint Convexity
For a function defined on a convex set in a Euclidean space, midpoint convexity is the property requiring that the value of the function at the midpoint of any line segment is not greater than the average of its values at the endpoints of the line segment. Midpoint convexity is a well-known characterization of ordinary convexity under very mild assumptions. For a function defined on the integer...
متن کاملConvexity, Duality and Effects
This paper describes some basic relationships between mathematical structures that are relevant in quantum logic and probability, namely convex sets, effect algebras, and a new class of functors that we call ‘convex functors’; they include what are usually called probability distribution functors. These relationships take the form of three adjunctions. Two of these three are ‘dual’ adjunctions ...
متن کاملA Probabilistic Convexity Measure
In order to improve the effectiveness of shape based classification there is an ongoing interest in creating new shape descriptors or creating new measures for descriptors that are already defined and used in shape classification tasks. Convexity is one of the most widely used shape descriptors and also one of the most studied in the literature. There are already several defined convexity measu...
متن کاملConvexity and Duality in Hamilton-Jacobi Theory
Value functions propagated from initial or terminal costs and constraints by way of a differential inclusion, or more broadly through a Lagrangian that may take on∞, are studied in the case where convexity persists in the state argument. Such value functions, themselves taking on ∞, are shown to satisfy a subgradient form of the Hamilton-Jacobi equation which strongly supports properties of loc...
متن کاملSDCA without Duality, Regularization, and Individual Convexity
Stochastic Dual Coordinate Ascent is a popular method for solving regularized loss minimization for the case of convex losses. We describe variants of SDCA that do not require explicit regularization and do not rely on duality. We prove linear convergence rates even if individual loss functions are non-convex, as long as the expected loss is strongly convex.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Aequationes mathematicae
سال: 2017
ISSN: 0001-9054,1420-8903
DOI: 10.1007/s00010-017-0486-7